Translating Inheritance Nets to Default Logic
نویسنده
چکیده
We give a translation of inheritance nets to normal default theories. To avoid discussions about sceptical and credulous reasoning we only regard unambiguous nets but allow explicit exception links restricting the validity of direct links. Contrary to former translations every link will be translated to a \hard" fact of the corresponding default theory while the defaults only represent the implicit assumptions made when computing the extension of the net. The translation is sound and complete if we restrict the deduction mechanism of default logic appropriately .
منابع مشابه
Abnormality Counts ! MSc
Defeasible inheritance networks provide a fruitful environment for modeling default reasoning. In this paper we aim to enhance their expressive power with the idea of abnormality minimisation, which plays a crucial role in circumscription. We implement it in two alternative network-based frameworks. The rst is in line with the received way of modeling default reasoning by means of inheritance n...
متن کاملNon-Monotonic Inference Rules for the Credulous Theory
Most of the theories that model default reasoning by means of defeasible inheritance networks proceed via construction of paths, and are therefore known as `path-based'. In spite of many advantages, these theories also face certain well-known problems. In particular, they do poorly when cyclic nets are at issue or when it comes up to extensions. In this paper we show that these problems may be ...
متن کاملReasoning about RDF statements with default rules
We propose a version of Local Closed-World Assumption that is well-suited for logic-based data and knowledge integration from disparate Web sources and for agent communication over the Web. To do so, we propose a default-based interpretation of the basic type inheritance primitives of RDF in terms of Answer Set Programs. Translating such statements into Answer Set Programming gives them an alte...
متن کاملClarifying Mixed Bipolar Multiple Inheritance with Exceptions
The inheritance problem can be simply stated: for any instantiation of an inheritance network , say a speciic hierarchy ? nd a conclusion set for ?. In other words nd out what is logically entailed by ?. This can be done in two ways: either by deening a deductive or proof theoretic deenition to determine what paths are entailed by a network; or by translating the individual links in the network...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کامل